A few-electron quadruple quantum dot in a closed loop

We report the realization of a quadruple quantum dot device in a square-like configuration where a single electron can be transferred on a closed path free of other electrons. By studying the stability diagrams of this system, we demonstrate that we are able to reach the few-electron regime and to control the electronic population of each quantum dot with gate voltages. This allows us to control the transfer of a single electron on a closed path inside the quadruple dot system. This work opens the route towards electron spin manipulation using spin-orbit interaction by moving an electron on complex paths free of electron

{SETH}-Based Lower Bounds for Subset Sum and Bicriteria Path

Subset-Sum and k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. One of the most intriguing open problems in this area is to base the hardness of one of these problems on the other. Our main result is a tight reduction from k-SAT to Subset-Sum on dense instances, proving that Bellman's 1962 pseudo-polynomial $O^{*}(T)$-time algorithm for Subset-Sum on $n$ numbers and target $T$ cannot be improved to time $T^{1-\varepsilon}\cdot 2^{o(n)}$ for any $\varepsilon>0$, unless the Strong Exponential Time Hypothesis (SETH) fails. This is one of the strongest known connections between any two of the core problems of fine-grained complexity. As a corollary, we prove a "Direct-OR" theorem for Subset-Sum under SETH, offering a new tool for proving conditional lower bounds: It is now possible to assume that deciding whether one out of $N$ given instances of Subset-Sum is a YES instance requires time $(N T)^{1-o(1)}$. As an application of this corollary, we prove a tight SETH-based lower bound for the classical Bicriteria s,t-Path problem, which is extensively studied in Operations Research. We separate its complexity from that of Subset-Sum: On graphs with $m$ edges and edge lengths bounded by $L$, we show that the $O(Lm)$ pseudo-polynomial time algorithm by Joksch from 1966 cannot be improved to $\tilde{O}(L+m)$, in contrast to a recent improvement for Subset Sum (Bringmann, SODA 2017)

Improved FPT algorithms for weighted independent set in bull-free graphs

Very recently, Thomass\'e, Trotignon and Vuskovic [WG 2014] have given an FPT algorithm for Weighted Independent Set in bull-free graphs parameterized by the weight of the solution, running in time $2^{O(k^5)} \cdot n^9$. In this article we improve this running time to $2^{O(k^2)} \cdot n^7$. As a byproduct, we also improve the previous Turing-kernel for this problem from $O(k^5)$ to $O(k^2)$. Furthermore, for the subclass of bull-free graphs without holes of length at most $2p-1$ for $p \geq 3$, we speed up the running time to $2^{O(k \cdot k^{\frac{1}{p-1}})} \cdot n^7$. As $p$ grows, this running time is asymptotically tight in terms of $k$, since we prove that for each integer $p \geq 3$, Weighted Independent Set cannot be solved in time $2^{o(k)} \cdot n^{O(1)}$ in the class of $\{bull,C_4,\ldots,C_{2p-1}\}$-free graphs unless the ETH fails.Comment: 15 page

Climate change communication in Colombia

This is the author accepted manuscript. The final version is available from Oxford University Press via the DOI in this record.Peru is one of the most biodiverse countries on the planet. More than 65% of the country is covered by the Amazon rainforest, and the Andes region is home to more than 70% of the world’s tropical glaciers. This abundance of natural resources also makes the country highly vulnerable to the effects of climate change. The Peruvian government therefore requires the development and implementation of action plans to adapt to the present and future impacts of climate change. At the same time, it requires the development of sound communication strategies that include collaboration with stakeholders such as the media and nongovernmental organizations. Media coverage of climate change can have important implications for policy decision making. This is especially salient in a context of low information availability where media reports play an important role in filling knowledge gaps that in turn can affect the way policies are developed. Climate change, as an environmental and social issue in Peru, is not highly politicized, as it is in countries such as the United States and Australia. There is no major debate about the reality of climate change, the scientific evidence, or the need for political action and technological and policy innovations. This approach is also reflected in the media’s coverage of the issue. Peru’s media tend to focus on climate change mostly during key policy events. Among these major events was the capital city of Lima’s hosting in 2010 of the V meeting of Latin American, Caribbean, and European Union countries, where the main topics of discussion were climate change and poverty. In addition, Lima hosted the COP20, which preceded the Paris meeting in 2015 that led to a major global agreement. The media’s coverage of these events was intense. These were the exceptions: A good proportion of Peru’s newspaper coverage comes from international news wire agencies. Coverage from those sources focuses mostly on mitigation actions, instead of adaptation, which is more relevant to vulnerable countries such as Peru. This coverage is in line with the government’s view of mitigation as a business opportunity. There is, however, a lack of studies that explore, first, the factors that affect this coverage, and, second, the way other mediums such as television or radio cover the issue. Strategic communication by governmental organizations, as well as accurate and fact-based media reporting about climate change, is necessary to better communicate the urgency and magnitude of the problem to the general public, grassroots organizations, industry, and international agencies, among others

Injection of a single electron from static to moving quantum dots

We study the injection mechanism of a single electron from a static quantum dot into a moving quantum dot created in a long depleted channel with surface acoustic waves (SAWs). We demonstrate that such a process is characterized by an activation law with a threshold that depends on the SAW amplitude and the dot-channel potential gradient. By increasing sufficiently the SAW modulation amplitude, we can reach a regime where the transfer is unitary and potentially adiabatic. This study points at the relevant regime to use moving dots in quantum information protocols.Comment: 5 pages, 4 figure

Transmission Phase in the Kondo Regime Revealed in a Two-Path Interferometer

We report on the direct observation of the transmission phase shift through a Kondo correlated quantum dot by employing a new type of two-path interferometer. We observed a clear $\pi/2$-phase shift, which persists up to the Kondo temperature $T_{\rm K}$. Above this temperature, the phase shifts by more than $\pi/2$ at each Coulomb peak, approaching the behavior observed for the standard Coulomb blockade regime. These observations are in remarkable agreement with 2-level numerical renormalization group calculations. The unique combination of experimental and theoretical results presented here fully elucidates the phase evolution in the Kondo regime.Comment: 4 pages, 3 figure

Cytotoxic activity of crude and partially purified ink of L.duvauceli towards HepG2cell line

ABSTRACT The present study aims to evaluate the anticancer activity of the crude and partially purified protein fractionated ink of Loligo duvauceli on the Hep G2 cell line using cell viability and cell proliferation assay (MTT assay). Different concentrations of the ink were prepared (125µg, 250µg, 500µg) and the cytotoxic activity was determined. Among the three doses tested, the crude ink of L.duvauceli at the concentration of 500 µg/ml was found to inhibit the viability of the cell effectively and the percentage of viability ranged between 33 -41. Cells viability decreased with increasing concentrations of the samples. HepG2 cells treated with protein fractionated ink, decreased the percentage of viability and the percentage ranged from 30-49. MTT assay revealed that partially purified ink of L. duvauceli showed higher activity than that of crude ink. The percentage of cell death was 70 in partially purified protein fractionated ink and 67% in crude ink at a concentration of 500µg. IC 50 value was obtained at a concentration of 125µg. The present findings suggest the profound anticarcinogenic activity of partially purified ink of L.duvauceli on HepG2 cancer cell line. Further purified compounds can be used as a potential chemotherapeutic drug for the treatment of Hepatic cancer

Fast end efficient single electron transfer between distant quantum dots

International audienceLateral quantum dots are a promising system for quantum information processing devices. The required basic manipulations of a single electron spin have indeed been demonstrated. However, a stringent requirement is the ability to transfer quantum information from place to place within one sample. In this work, we explore and demonstrate the possibility to transfer a single electron between two distant quantum dots in a fast and reliable manner

Polynomial kernelization for removing induced claws and diamonds

A graph is called (claw,diamond)-free if it contains neither a claw (a $K_{1,3}$) nor a diamond (a $K_4$ with an edge removed) as an induced subgraph. Equivalently, (claw,diamond)-free graphs can be characterized as line graphs of triangle-free graphs, or as linear dominoes, i.e., graphs in which every vertex is in at most two maximal cliques and every edge is in exactly one maximal clique. In this paper we consider the parameterized complexity of the (claw,diamond)-free Edge Deletion problem, where given a graph $G$ and a parameter $k$, the question is whether one can remove at most $k$ edges from $G$ to obtain a (claw,diamond)-free graph. Our main result is that this problem admits a polynomial kernel. We complement this finding by proving that, even on instances with maximum degree $6$, the problem is NP-complete and cannot be solved in time $2^{o(k)}\cdot |V(G)|^{O(1)}$ unless the Exponential Time Hypothesis fai